Language of mathematics

Results: 1871



#Item
481Computer science / Applied mathematics / Regular language / Tree automaton / Complementation of Büchi automaton / Ω-automaton / Automata theory / Formal languages / Theoretical computer science

Noname manuscript No. (will be inserted by the editor) Synchronizing Relations on Words Diego Figueira · Leonid Libkin

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2014-11-26 07:54:43
482Character encoding / Digital typography / Symbol / Mathematics / Orbifold / Proof theory / Programming language semantics / Logic in computer science

The Spirit of Ghost Code Jean-Christophe Filliˆ atre1,2 , L´eon Gondelman1? , and Andrei Paskevich1,2 1 Lab. de Recherche en Informatique, Univ. Paris-Sud, CNRS, Orsay, F-91405

Add to Reading List

Source URL: bware.lri.fr

Language: English - Date: 2014-09-27 10:51:46
483Mathematics / Applied mathematics / Regular language / Recognizable language / Tree automaton / Constructible universe / Formal languages / Automata theory / Theoretical computer science

Synchronizing Relations on Words Diego Figueira and Leonid Libkin University of Edinburgh, UK Abstract While the theory of languages of words is very mature, our understanding of relations on words

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2014-03-01 14:59:36
484Theoretical computer science / Mathematics / Combinatorics on words / Models of computation / Finite state transducer / Finite-state machine / Regular expression / Regular language / String / Formal languages / Automata theory / Combinatorics

Regular Functions Rajeev Alur University of Pennsylvania 1

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2014-10-13 10:13:47
485Type theory / Dependently typed programming / Lambda calculus / Formal methods / Recursion / Calculus of constructions / Calculus of inductive constructions / Coq / Dependent type / Programming language theory / Mathematics / Algebra

CoqInE: Translating the Calculus of Inductive Constructions into the λΠ-calculus Modulo Mathieu Boespflug1 and Guillaume Burel2 1 McGill University Montr´eal, Qu´ebec, Canada

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2012-07-23 07:37:37
486Parameter / Argument / Scheme / Function / Subroutines / Mathematics / Software engineering

C. Optional Arguments This proposal for managing optional arguments and “rest” arguments in messages is consistent with the existing syntax of the language, Energetic Secrets (see Appendix D), and efficient implemen

Add to Reading List

Source URL: erights.org

Language: English - Date: 2004-12-04 19:43:49
487Finite state transducer / Finite-state machine / Speech recognition / Computer science / Mathematical optimization / Applied mathematics / Computing / Automata theory / Models of computation / Computational linguistics

Direct Construction of Compact Context-Dependency Transducers From Data David Rybach∗ Michael Riley Human Language Technology

Add to Reading List

Source URL: wiki.inf.ed.ac.uk

Language: English - Date: 2010-11-05 06:38:47
488Information extraction / Natural language processing / Finitary relation / Tuple / Relation / Ext JS / Science / Mathematics / Relational model / Artificial intelligence

Open Information Extraction from the Web Michele Banko, Michael J Cafarella, Stephen Soderland, Matt Broadhead and Oren Etzioni Turing Center Department of Computer Science and Engineering University of Washington Box 35

Add to Reading List

Source URL: turing.cs.washington.edu

Language: English - Date: 2006-10-19 18:08:12
489Mathematics / Lambda calculus / Dependently typed programming / Logic in computer science / Proof theory / Natural deduction / Curry–Howard correspondence / Calculus of constructions / Type system / Type theory / Programming language theory / Theoretical computer science

The λΠ-calculus Modulo as a Universal Proof Language Mathieu Boespflug1 , Quentin Carbonneaux2 and Olivier Hermant3 1 2

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2012-07-25 10:49:31
490Computer science / Applied mathematics / Tree automaton / Regular language / Ω-automaton / Automata theory / Formal languages / Theoretical computer science

Recurrent Reachability Analysis in Regular Model Checking Anthony Widjaja To and Leonid Libkin LFCS, School of Informatics, University of Edinburgh anthony.w.to,

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2008-09-22 08:03:38
UPDATE